翻訳と辞書 Words near each other ・ Second-Hand ・ Second-Hand Hearts ・ Second-hand shop ・ Second-hand Smoke ・ Second-harmonic generation ・ Second-harmonic imaging microscopy ・ Second-impact syndrome ・ Second-in-command ・ Second-language acquisition ・ Second-language acquisition classroom research ・ Second-language attrition ・ Second-language phonology ・ Second-level domain ・ Second-order ・ Second-order arithmetic ・ Second-order cellular automaton ・ Second-order co-occurrence pointwise mutual information ・ Second-order conditioning ・ Second-order cone programming ・ Second-order cybernetics ・ Second-order election ・ Second-order fluid ・ Second-order intercept point ・ Second-order logic ・ Second-order predicate ・ Second-order propositional logic ・ Second-order simulacra ・ Second-order stimulus ・ Second-person narrative ・ Second-rate Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Second-order cellular automaton ： ウィキペディア英語版 Second-order cellular automaton A second-order cellular automaton is a type of reversible cellular automaton (CA) invented by Edward Fredkin〔. Reprinted in .〕〔 where the state of a cell at time depends not only on its neighborhood at time , but also on its state at time .〔.〕 ==General technique== In general, the evolution rule for a second-order automaton may be described as a function that maps the neighborhood of a cell to a permutation on the states of the automaton. In each time step , for each cell of the automaton, this function is applied to the neighborhood of to give a permutation . Then, this permutation is applied to the state of cell at time , and the result is the state of the cell at time . In this way, the configuration of the automaton at each time step is computed from two previous time steps: the immediately previous step determines the permutations that are applied to the cells, and the time step before that one gives the states on which these permutations operate.〔 The reversed time dynamics of a second-order automaton may be described by another second-order automaton with the same neighborhood, in which the function mapping neighborhoods to permutations gives the inverse permutation to . That is, on each possible neighborhood , and should be inverse permutations. With this reverse rule, the automaton described by function correctly computes the configuration at time from the configurations at time and . Because every second-order automaton can be reversed in this way, it follows that they are all reversible cellular automata, regardless of which function is chosen to determine the automaton rule.〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Second-order cellular automaton」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.